منابع مشابه
Literal Shuffle of Compressed Words
Straight-Line Programs (SLP) are widely used compressed representations of words. In this work we study the rational transformations and the literal shuffle of words compressed via SLP, proving that the first preserves the compression rate, while the second does not. As a consequence, we prove a tight bound for the descriptional complexity of 2D texts compressed via SLP. Finally, we observe tha...
متن کاملLiteral-paraconsistent and literal-paracomplete matrices
We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by the class of all these matrices, we give conditions for the maximality of these logics and we study in detail ...
متن کاملLiteral Reification
In this paper we introduce the pattern literal reification, a modelling technique to address scenarios, in which we need to bless particular literals, usually when applying data properties, in order to use them as subjects and/or full-fledged objects of semantic assertions.
متن کاملDistinguishing Literal and Non-Literal Usage of German Particle Verbs
This paper provides a binary, token-based classification of German particle verbs (PVs) into literal vs. non-literal usage. A random forest improving standard features (e.g., bagof-words; affective ratings) with PV-specific information and abstraction over common nouns significantly outperforms the majority baseline. In addition, PV-specific classification experiments demonstrate the role of sh...
متن کاملShuffle Bialgebras
The goal of our work is to study the spaces of primitive elements of the Hopf algebras associated to the permutahedra and the associahedra. We introduce the notion of shuffle bialgebras, and compute the subpaces of primitive elements associated to these algebras. These spaces of primitive elements have natural structure of some type of algebras which we describe in terms of generators and relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1987
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90037-5